package com.dyz.leetcode._05_sort;

import java.lang.reflect.Array;
import java.util.Arrays;
import java.util.Comparator;

public class mergeSortDemo {
    public int[] mergeSort(int[] nums){

    return new int[]{};
    }

    public static void main(String[] args) {
        int [] nums = new int[]{1,3,2,7,4,9,5};
       
        System.out.println(nums);
    }
}
